Function spaces with dominating mixed smoothness

نویسنده

  • Hans-Jürgen Schmeisser
چکیده

Acknowledgements I would like to express my deepest appreciation to my supervisors Professor Hans-Jürgen Schmeisser and Professor Winfried Sickel for their support and many hints and comments. I thank also Professor Hans Triebel for many valuable discussions on the topic of this work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal cubature in Besov spaces with dominating mixed smoothness on the unit square

We prove new optimal bounds for the error of numerical integration in bivariate Besov spaces with dominating mixed order r. The results essentially improve on the so far best known upper bound achieved by using cubature formulas taking points from a sparse grid. Motivated by Hinrichs’ observation that Hammersley type point sets provide optimal discrepancy estimates in Besov spaces with mixed sm...

متن کامل

A Tool for Approximation in Bivariate Periodic Sobolev Spaces

We give a characterization of Sobolev spaces of bivariate periodic functions with dominating smoothness properties in terms of Sobolev spaces of univariate functions. The mixed Sobolev norm is proved to be a uniform crossnorm. This property can be used as a powerful tool in approximation theory. x1. Introduction Beside the approximation of functions from the usual isotropic periodic Sobo-lev sp...

متن کامل

Quasi-Monte Carlo methods for integration of functions with dominating mixed smoothness in arbitrary dimension

In a celebrated construction, Chen and Skriganov gave explicit examples of point sets achieving the best possible L2-norm of the discrepancy function. We consider the discrepancy function of the ChenSkriganov point sets in Besov spaces with dominating mixed smoothness and show that they also achieve the best possible rate in this setting. The proof uses a b-adic generalization of the Haar syste...

متن کامل

Lattice based integration algorithms: Kronecker sequences and rank-1 lattices

We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study worst-case integration errors for Besov spaces of dominating mixed smoothness B̊p,θ, which also comprise the concept of Sobolev spaces of dominating mixed smoothness...

متن کامل

Interpolation on Sparse Gauss-Chebyshev Grids in Higher Dimensions

In this paper, we give a unified approach to error estimates for interpolation on sparse Gauß–Chebyshev grids for multivariate functions from Besov–type spaces with dominating mixed smoothness properties. The error bounds obtained for this method are almost optimal for the considered scale of function spaces. 1991 Mathematics Subject Classification: 41A05, 41A63, 65D05, 46E35

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005